The NP-completeness of a tomographical problem on bicolored domino tilings
نویسندگان
چکیده
منابع مشابه
On the NP-Completeness of the Minimum Circuit Size Problem
We study the Minimum Circuit Size Problem (MCSP): given the truth-table of a Boolean function f and a number k, does there exist a Boolean circuit of size at most k computing f? This is a fundamental NP problem that is not known to be NP-complete. Previous work has studied consequences of the NP-completeness of MCSP. We extend this work and consider whether MCSP may be complete for NP under mor...
متن کاملHeight Function on Domino Tilings
We first define the height function on a domino tiling (as done in [1]) and state some of its basic properties. We then revisit the coupling function and relate it to Green’s function, which allows us to conclude that the coupling function converges in the limit to an analytic function with a pole. Using this, we do a general second moment calculation via the proof found in [1] which writes the...
متن کاملDomino Tilings of a Checkerboard
for n ≥ 2, it can be shown that fn counts the number of ways to tile a 1 × n board with squares and dominoes. This interpretation of the Fibonacci numbers admits clever counting proofs of many Fibonacci identities. When we consider more complex combinatorial objects, we find that simply counting the number of tilings is not quite enough, and that we must consider instead weighted tilings. For e...
متن کاملOn the Shuffling Algorithm for Domino Tilings∗
We study the dynamics of a certain discrete model of interacting interlaced particles that comes from the so called shuffling algorithm for sampling a random tiling of an Aztec diamond. It turns out that the transition probabilities have a particularly convenient determinantal form. An analogous formula in a continuous setting has recently been obtained by Jon Warren studying certain model of i...
متن کاملSpaces of Domino Tilings
We consider the set of all tilings by dominoes (2 1 rectangles) of a surface, possibly with boundary, consisting of unit squares. Convert this set into a graph by joining two tilings by an edge if they diier by a ip, i.e., a 90 rotation of a pair of side-by-side dominoes. We give a criterion to decide if two tilings are in the same connected component, a simple formula for distances and a metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.004